Clique-Width and Directed Width Measures for Answer-Set Programming
نویسندگان
چکیده
Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Identifying tractable fragments and developing efficient algorithms for such fragments are thus important objectives in order to complement the sophisticated ASP systems available to date. Hard problems can become tractable if some problem parameter is bounded by a fixed constant; such problems are then called fixed-parameter tractable (FPT). While several FPT results for ASP exist, parameters that relate to directed or signed graphs representing the program at hand have been neglected so far. In this paper, we first give some negative observations showing that directed width measures on the dependency graph of a program do not lead to FPT results. We then consider the graph parameter of signed clique-width and present a novel dynamic programming algorithm that is FPT w.r.t. this parameter. Clique-width is more general than the well-known treewidth, and, to the best of our knowledge, ours is the first FPT algorithm for bounded clique-width for reasoning problems beyond SAT.
منابع مشابه
NCE Graph Grammars and Clique-Width
Graph grammars are widely used in order to deene classes of graphs having some inductive and narrow structure. In many cases the narrowness can be measured in terms of the maximal tree-width and/or clique-width of the graphs in the class, (see RS86],,CO00] for deenitions of these notions). It is known that using the corresponding tree-decomposition or clique-width parse term, any property of th...
متن کاملGraphs of Bounded Rank-width
We define rank-width of graphs to investigate clique-width. Rank-width is a complexity measure of decomposing a graph in a kind of tree-structure, called a rankdecomposition. We show that graphs have bounded rank-width if and only if they have bounded clique-width. It is unknown how to recognize graphs of clique-width at most k for fixed k > 3 in polynomial time. However, we find an algorithm r...
متن کاملSubgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological ordering, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula φ and are the union of k directed paths, in time f(φ, k, z) · n. Our result implies the polynomial time solvabilit...
متن کاملReasoning in Argumentation Frameworks of Bounded Clique-Width
Most computational problems in the area of abstract argumentation are intractable, thus identifying tractable fragments and developing efficient algorithms for such fragments are important objectives towards practically efficient argumentation systems. One approach to tractability is to view abstract argumentation frameworks (AFs) as directed graphs and bound certain graph parameters. In partic...
متن کاملLinear Rank-Width and Linear Clique-Width of Trees
We show that for every forest T the linear rank-width of T is equal to the path-width of T , and the linear clique-width of T equals the path-width of T plus two, provided that T contains a path of length three. It follows that both linear rank-width and linear clique-width of forests can be computed in linear time. Using our characterization of linear rank-width of forests, we determine the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016